Transmission of trustworthy data

ABSTRACT

A method and system for transmitting trustworthy data. A data file (F 0 ) of raw data including content is received. Changes to the content of the data file F 0  are tracked. The changes produce n changed versions of the data file (n≧1). Changed version j of the data file is denoted as F j  for each positive integer j between 1 and n inclusive. Content that was changed in each version F 1 , . . . , F n  of the data file is determined. A trust index TX n  associated with the changed version F n  of the data file is calculated, based on a cumulative number of changes between successive versions F 0 , F 1 , . . . , F n  of the data file. In response to a request received from a computing device for the data file F n , the data file F n  and the tust index TX n  are transmitted to the computing device.

TECHNICAL FIELD

The present invention relates to veracity of information, and more specifically to transmitting trustworthy data having an associated trust index indicating a veracity of the data that is to be transmitted.

BACKGROUND

In order to ensure that data can be trusted, data quality needs to be controlled, and in particular the extent of modifications to raw data needs to be known.

Prior art tools, such as Extract, Transform and Load (ETL) tools, extract data from homogeneous or heterogeneous data sources, and transform the data for storing the data in proper format or structure for querying and analysis purpose and for loading the data into a final target such as a database. Examples of such prior art ETL tools include Ab Initio®, IBM® InfoSphere® DataStage®, Informatica®, Oracle® Data Integrator and SAP® Data Integrator. Such prior art tools try to increase a level of data quality by putting in place controls, such as functional (semantic) controls and technical controls.

SUMMARY

The present invention provides a method, and associated system and computer program product, for transmitting trustworthy data. A data file (F₀) of raw data comprising content is received by a processor of a computer system. F₀ is a version zero of the data file. Changes to the content of the data file F₀ are tracked by the processor. The changes produce n changed versions of the data file (n≧1). Changed version j of the data file is denoted as F_(j) for each positive integer j between 1 and n inclusive. The processor determines content that was changed in each version F₁, . . . , F_(n) of the data file. The processor calculates a trust index TX_(n) associated with the changed version F_(n) of the data file, based on a cumulative number of changes between successive versions F₀, F₁, . . . , F_(n), of the data file. In response to a request received from a computing device for the data file F_(n), the processor transmits the data file F_(n) and the trust index TX_(n) to the computing device.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a flow chart of a computer-implemented method of calculating a trust index associated with data in a database file, in accordance with embodiments of the present invention.

FIG. 2 shows an initial database file, which is version zero of the database file, containing raw data, in accordance with embodiments of the present invention.

FIG. 3 shows a flow chart of a trust index updating step of FIG. 1, in accordance with embodiments of the present invention.

FIG. 4 shows a subsequent version one of the database file of FIG. 2 containing changes, in accordance with embodiments of the present invention.

FIG. 5 shows a subsequent version two of the database file of FIG. 2 containing further changes, in accordance with embodiments of the present invention.

FIG. 6 shows a subsequent version three of the database file of FIG. 2 containing yet further changes, in accordance with embodiments of the present invention.

FIG. 7 shows a flow chart depicting a process of using a trust index associated with data, in accordance with embodiments of the present invention.

FIG. 8 shows a block diagram of an embodiment of a system for calculating a trust index associated with data, in accordance with embodiments of the present invention.

FIG. 9 shows a computer system for implementing methods of the present invention, in accordance with embodiments of the present invention.

DETAILED DESCRIPTION

Prior art tools, such as Extract, Transform and Load (ETL) tools, try to increase a level of data quality by putting in place controls, such as functional (semantic) controls and technical controls, but these controls are insufficient to increase a level of data quality. What is missing from the prior art tools is knowledge of whether the data being used is really raw data or whether, and to what extent, the data being used has already been modified.

FIG. 1 shows a flow chart of a computer-implemented method of calculating a trust index associated with data in a database file, in accordance with embodiments of the present invention. A trust index is associated with data, such as a database or a file. In one embodiment, the trust index may be used to populate a Veracity Key Performance Indicator (KPI) thus providing an end user of the information with a measure of trust that can be placed in the information, which provides an advantage over prior art tools that typically indicate only an intuitive measurement of the trust to be placed in the information, rather than a specific measurement.

“Big data” is a broad term for data sets so large or complex that traditional data processing applications are inadequate. Big data can be broken down into four dimensions: Volume, Variety, Velocity and Veracity.

Volume denotes a quantity of data that is generated. As of 2012, two point five trillion gigabytes of data were created globally each day.

Variety denotes a variety of different forms of data. In 2011, the global size of data in healthcare was estimated to be one hundred and sixty one billion gigabytes. Thirty billion pieces of content are shared on Facebook® every month. Four hundred million tweets are sent each day by about two hundred million active users. More than our billion hours of video are watched on YouTube® each month.

Velocity denotes a speed of generation of data or how fast the data is generated and processed. By 2016, it is projected that there will be eighteen point nine billion network connections or almost two and a half network connections per person on earth. The New York Stock Exchange captures one thousand gigabytes of trade information during each trading session. A modern car has close to one hundred sensors that monitor items such as fuel level and tire pressure.

Veracity denotes a quality of data, or an uncertainty associated with data, being captured, which can vary greatly. It has been found that one in three business leaders do not trust the information they use to make business decisions. Poor data quality costs the US economy around $3.1 trillion per year. Twenty seven percent of respondents in one survey were unsure of how much of the respondents' data was inaccurate.

The method of FIG. 1 starts at step 102. At step 104, a data file of raw data comprising content (F₀) is received by a computer system (e.g., the computer system 912 of FIG. 9).

FIG. 2 shows an initial database file, which is version zero of the database file, containing raw data, in accordance with embodiments of the present invention. The raw data file in Table 1 below is pseudocode defining a “contacts” table.

TABLE 1 define table contacts ( first_name char(20), last_name char(20), e-mail char(40), mobile_phone char(20), company char(100), location char(100) );

The raw data file, version zero (denoted F₀) shown in FIG. 2, comprises seven rows or records of data and six columns or fields of data. This content of file F₀ (denoted as C(F₀)) is measured by the size of F₀, wherein the size of F₀ is the product of the number of columns and the number of rows of F₀ representing the initial content of the data file. The size of F₀ is represented by C(F₀). Since the initial content of the data file F₀ comprises seven rows and six columns, the value of C(F₀) is 42, that is seven rows multiplied by six columns. The fields of data chosen are purely exemplary and in practice and it is likely that many more fields of data would be used, particularly in “Big data” applications. The seven records are also merely exemplary and in a practical application, it is likely that many more than seven records would be present in the raw data file. The use of a “contacts” database is also merely exemplary and any database or other data file may be used.

At step 106, a trust index is initialized and associated with the raw data file F₀ of FIG. 2.

At step 108, changes made to the raw data file F₀ of FIG. 2 are tracked. The tracking of the changes is carried out, as described below with reference to FIG. 3, by the computer determining information about content that was changed each time the raw data file was copied to produce a changed version. The changes produces n changed versions of the raw data file F₀, wherein n is a positive integer of at least 1, and wherein changed version j of the data file is denoted as F_(j) for each positive integer j between 1 and n inclusive.

Whenever a new version (F_(n)) of the raw data file is identified, then at step 110, the trust index (TX_(n)) is calculated. The trust index TX_(n) associated with the changed version F_(n) of the data file is calculated, based on a cumulative number of changes between successive versions F₀, F₁, . . . , F_(n) of the data file. The step of updating the trust index will be further described below with reference to FIG. 3. The method ends at step 112.

FIG. 3 shows a flow chart of a trust index updating step 110 of FIG. 1, in accordance with embodiments of the present invention. The trust updating step starts at step 302. At step 304, a measure of a difference (called a “delta” herein) between the original version and the current version of the raw data file received at step 104 is determined.

FIG. 4 shows a subsequent version one of the database file of FIG. 1 containing changes, in accordance with embodiments of the present invention. FIG. 4 shows a version one, denoted F₁, of the raw data file F₀ of FIG. 1. The current version one is the original raw data file F₀ of FIG. 1 with changes made. The changes made are that Joey Miller has changed from working for Wal-Mart to working for ExxonMobil. Corresponding changes are made to Joey Miller's e-mail, mobilephone, company and location fields. Mark Williams has moved from the Bentonville, Ark. location of Wal-Mart to the York, Pa. location, but has retained the same e-mail and mobile_phone data. Sondra Davis has changed her mobile_phone number. The content of the current version of the file F₁ after one set of changes has been made is referred to as C(F₁). In a similar manner, when further changes are made, as will be described below, the content of the file F_(n) after “n” changes is referred to as C(F).

There are six changes described above for file F₁ in total relative to the raw data file. Thus, the value of the difference (denoted as DELTA₁(F)) between the cumulative number of changes made in the current version (C(F₁)) and the cumulative number of changes made in the previous version (C(F₀) is 6. This gives a value for DELTA₁(F) of 6.

At step 306, the computer calculates a trust index associated with a changed version of the data based on the cumulative number of changes between the raw data file and the changed version of the data. The trust index is calculated by summing the number of changes made between successive versions of the data, from the raw data file through each version to the changed current version of the data. The content of the original version (C(F₀)) is divided by the content of the current version (C(F₁)) to produce the Trust Index (TX₁). As stated above, for C(F₀), the total number of elements (i.e., seven rows multiplied by six columns) is 42. The content of current version (C(F₁)) is equal to content of the original version (C(F₀) plus the delta (DELTA₁(F)).

Calculation of the Trust Index (TX_(n)) for file F_(n) (n being a positive integer of at least 1) uses the formulas:

${TX}_{n} = \frac{C\left( F_{0} \right)}{C\left( F_{n} \right)}$ C(F_(n)) = C(F₀) + DELTA_(n)(F) ${Thus},{{TX}_{n} = \frac{C\left( F_{0} \right)}{{C\left( F_{0} \right)} + {{DELTA}_{n}(F)}}}$ wherein ${{DELTA}_{n}(F)} = {\sum\limits_{t = 1}^{n}{{DELTA}\left( F_{t} \right)}}$

and

DELTA(F_(t)) is the difference (i.e., number of changes) between the content of file F_(t-1) and the content of file F_(t) for 1≦t≦n.

Thus, for n=1,

${TX}_{1} = \frac{C\left( F_{0} \right)}{C\left( F_{1} \right)}$ C(F₁) = C(F₀) + DELTA₁(F) ${Therefore},{{TX}_{1} = \frac{C\left( F_{0} \right)}{{C\left( F_{0} \right)} + {{DELTA}_{1}(F)}}}$

DELTA₁(F)=DELTA(F₁)=6. Since C(F₀) is equal to 42 and DELTA₁(F) is equal to 6, the Trust Index (TX₁) for file F₁ is equal to 42/(42+6)=0.875 or 87.5%. The Trust Index will always be equal to one or less. A Trust Index equal to 1 means that the original version and the current version are the same, and that no changes were made to the original version and to any other version, and the resulting data can be trusted. The more the data is copied, transformed or changed, the more differences there will be and the lower the Trust Index will be.

FIG. 5 shows a new current version two (F₂) of the database data file of FIG. 1 containing raw data, in accordance with embodiments of the present invention. In FIG. 5, the new current version two (F₂) is the previous version one (F₁) of FIG. 4 with further changes made, namely five changes. The five changes made are that e-mail addresses and mobile phone numbers associated with Wal-Mart are changed. The e-mail address domain changes from abc.com to xyz.com and the center portion of the mobile phone numbers change from “123” to “234”. Thus, there are now eleven changes in total to the original raw data file (C(F₀)), giving a value for DELTA₂(F) of 11 (i.e., 6+5). The content of the new current version of the file after two sets of changes has been made will be referred to as C(F₂).

At step 306, the trust index is calculated. Starting with the original version C(F₀), changes as described above were made to produce versions one (C(F₁) and two (C(F₂)). The ratio of the previous version file content (C(F₀)) to the current version (C(F₂)) file content is determined. The total number of elements, that is rows multiplied by columns, remains at 42. As stated supra, the formula used to calculate the cumulative delta DELTA_(n)(F) for an n^(th) change is:

DELTA_(n)(F)=Σ_(t=1) ^(n)DELTA(F _(t))

For example, for the version two of FIG. 5, DELTA₂(F) is equal to the sum of DELTA(F₁) which was 6, and DELTA(F₂) which was 5, making a total of 11.

At step 306, the content of the original version (C(F₀)) is divided by the content of the current version (C(F₂)) to produce a Trust Index (TX₂). The content of the current version (C(F₂)) is equal to the content of the original version (C(F₀)) plus the delta (DELTA₂(F)). Calculation of the Trust Index (TX₂) uses the formula:

${TX}_{2} = \frac{C\left( F_{0} \right)}{{C\left( F_{0} \right)} + {{DELTA}_{2}(F)}}$

Since C(F₀) is equal to 42 and DELTA₂(F) is equal to 11, then the Trust Index (TX₂) is equal to 42/(42+11)=0.792 or 79.2%.

FIG. 6 shows a subsequent version three (F₃) of the database file of FIG. 2 containing yet further changes, in accordance with embodiments of the present invention. The changes made are that Mark Williams has moved back to the Bentonville, Ark. location of Wal-Mart from the York, Pa. location, thus returning the location information field of his data record to the value it was in the original file. Mark has retained the same e-mail and mobile_phone data. Joey Miller has changed his mobile_phone number. This means that there are 2 new changes relative to file F₂ and 13 changes in total relative to the original raw data file. The content of the current version (F₃) of the file is referred to as C(F₃).

At step 306, the trust index is calculated. Starting with the original version (F₀), changes as described above were made to produce versions one (F₁), two (F₂) and three (F₃). As mentioned above, the formula used to calculate the cumulative delta for an n^(th) change is:

DELTA_(n)(F)=Σ_(t=1) ^(n)DELTA(F _(t))

For version three (F₃), there are two changes relative to F2, namely Joey's mobile phone number and Mark's location. Thus, DELTA₃(F) is equal to the sum of DELTA(F₁) which was 6, DELTA(F₂) which was 5, DELTA(F₃) which was 2, making a total of 13.

The content of the original version (C(F₀)) is divided by t content of the he current version (C(F₃)) to produce a Trust Index (TX₃). The content of the current version (C(F₃)) is equal to content of the original version (C(F₀)) plus the delta (DELTA₃(F)). The Trust Index is calculated using the formula:

${TX}_{3} = \frac{C\left( F_{0} \right)}{{C\left( F_{0} \right)} + {{DELTA}_{3}(F)}}$

Since C(F₀) is equal to 42 and DELTA₃(F) is equal to 13, then the Trust Index (TX) is equal to 42/(42+13)=0.764 or 76.4%.

The Trust Index (TX_(n)) is a measure of the trust which can be placed on the changed data in file F_(n). The Trust Index (TX_(n)) for each of the subsequent versions 1 to 3 (i.e., F₁, F₂, F₃) of FIGS. 4 to 6, respectively, are shown in the Table 2 below:

TABLE 2 R C Number (Number (Number R × Ver- of changes of records of fields R × C sion (DELTA) (rows)) (columns)) C (changed) TX_(n) F₀ 0 7 6 42 0 N/A F₁ 6 7 6 42 6 87.5% F₂ 5 7 6 42 11 79.2% F₃ 2 7 6 42 2 76.4%

FIG. 7 shows a flow chart depicting a process of using a trust index associated with data, in accordance with embodiments of the present invention. In one embodiment, the data is to be used to populate a Big Data and Analytics system. The trust index is used as a Key Performance Indicator for the Veracity of changed versions of the data. The process of FIG. 7 starts at step 702.

At step 704, the raw data is received. The current version Fn of the changed raw data, together with the associated trust index TX_(n), is to be subsequently transmitted (in step 712 discussed infra) to a requestor in response to a request from the requestor for the current version F_(n) of the changed raw data from the computing device. The requestor requires F_(n) for performing an operation on F_(n) or for using F_(n) for a particular useful purpose. The requestor may be a computing device. The requestor may be within, or external to, the computer system (e.g. computer system 912 of FIG. 9) that computes the trust index TX_(n). In the examples of raw data above, the raw data and/or information is version zero with a 100% trust index, version one with a 87.5% trust index, version two with a 79.2% trust index, or version three with a 76.4% trust index.

At step 706, a determination is made as to whether the value of the trust index TX_(n) is acceptable by comparing TX_(n) with a predetermined threshold TX_(min). If the trust index value is not acceptable (i.e., TX_(n)<TX_(min)), then at step 710 the data is rejected. In one embodiment, a transformation of the raw data into information may take place, but a warning that the data has an unacceptable trust index may be associated with the transformed data. The example application ends at step 716

If the trust index value is acceptable (i.e., TX_(n)≧TX_(min)), then at step 712 the data is accepted and is used to transmit trusted information to a requestor. Specifically, the current version F_(n) of the changed raw data and the associated trust index TX_(n), is transmitted to the requestor who had requested the current version F_(n) of the changed raw data. The requestor requires F_(n) for performing an operation on F_(n) or for using F_(n) for a particular useful purpose. The requestor may be a computing device. The requestor may be within, or external to, the computer system that computes the trust index TX_(n).

At step 714, the trust index is used to update the Key Performance Indicator associated with the Veracity of the data.

In one embodiment in which TX_(n)<TX_(min) in step 706 and n>1, the trust index TX_(n-1) for the previous version F_(n-1) is computed and tested against the threshold TX_(min) for acceptability and if TX_(n-1) is acceptable (i.e., TX_(n-1)≧TX_(min)) and if the previous version F_(n-1) is determined to be acceptable for the intended use of the changed raw data, then steps 712 and 714 are performed for F_(n-1) and TX_(n-1).

The example application ends at step 716.

FIG. 8 shows a block diagram of an embodiment of a system for calculating a trust index associated with data, in accordance with embodiments of the present invention. A raw data file 810 is received. Raw data file content change tracker 830 determines information about content that was changed each time the raw data file 810 was copied to produce a changed version of raw data file 810. Trust index calculator 840 calculates a trust index 820 which is then associated with a changed version of the raw data file 810. Trust index calculator calculates trust index 820 based on the cumulative number of changes between the raw data file 810 and the changed version of the data.

In an embodiment, the trust index 820 is calculated by summing the number of changes made between successive versions of the data, from the raw data file 810 (F₀) through each version F_(t)(1≦t≦n) to the changed version (F_(n)) of the data.

In an embodiment, the trust index 820 for the changed version F_(n) of data is calculated using the formula:

${TX}_{n} = \frac{C\left( F_{0} \right)}{{C\left( F_{0} \right)} + {{DELTA}_{n}(F)}}$

wherein:

C(F0) is the total number of elements in the raw data file; and

DELTA_(n)(F)=Σ_(t=1) ^(n)DELTA(F _(t))

DELTA(F_(t)) is the number of elements changed between version t−1 and version t, wherein F₀ is the raw data file.

As described above with reference to FIG. 7, the trust index may be used as a Key Performance Indicator for the Veracity of the changed version of the raw data file.

FIG. 9 shows a computer system 912 for implementing methods of the present invention, in accordance with embodiments of the present invention. Computer system/server 912 is only one example of a suitable computer system and is not intended to suggest any limitation as to the scope of use or functionality of embodiments of the invention described herein. Regardless, computing system 912 is capable of being implemented and/or performing any of the functionality set forth hereinabove.

Computer system/server 912 is operational with numerous other general purpose or special purpose computer system environments or configurations. Examples of well-known computer systems, environments, and/or configurations that may be suitable for use with computer system/server 912 include, but are not limited to, personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments that include any of the above systems or devices, and the like.

Computer system/server 912 may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types. Computer system/server 912 may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.

As shown in FIG. 9, computer system/server 912 is shown in the form of a general-purpose computing device. The components of computer system/server 912 may include, but are not limited to, one or more processors or processing units 916, a system memory 928, and a bus 918 that couples various system components including system memory 928 to processor 916.

Bus 918 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.

Computer system/server 912 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer system/server 912, and it includes both volatile and non-volatile media, removable and non-removable media.

System memory 928 can include computer system readable media in the form of volatile memory, such as random access memory (RAM) 930 and/or cache memory 932. Computer system/server 912 may further include other removable/non-removable, volatile/non-volatile computer system storage media. By way of example only, storage system 934 can be provided for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”). Although not shown, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a “floppy disk”), and an optical disk drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media can be provided. In such instances, each can be connected to bus 918 by one or more data media interfaces. As will be further depicted and described below, memory 928 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.

Program/utility 940, having a set (at least one) of program modules 942, may be stored in memory 928 by way of example, and not limitation, as well as an operating system, one or more application programs, other program modules, and program data. Each of the operating system, one or more application programs, other program modules, and program data or some combination thereof, may include an implementation of a networking environment. Program modules 942 generally carry out the functions and/or methodologies of embodiments of the invention as described herein.

Computer system/server 912 may also communicate with one or more external devices 914 such as a keyboard, a pointing device, a display 924, etc.; one or more devices that enable a user to interact with computer system/server 912; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 912 to communicate with one or more other computing devices. Such communication can occur via Input/Output (I/O) interfaces 922. Still yet, computer system/server 912 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 920. As depicted, network adapter 920 communicates with the other components of computer system/server 912 via bus 918. It should be understood that although not shown, other hardware and/or software components could be used in conjunction with computer system/server 912. Examples, include, but are not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.

The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, column-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

A computer program product of the present invention comprises one or more computer readable hardware storage devices having computer readable program code stored therein, said program code containing instructions executable by one or more processors to implement the methods of the present invention.

A computer system of the present invention comprises one or more processors, one or more memories, and one or more computer readable hardware storage devices, said one or more hardware storage device containing program code executable by the one or more processors via the one or more memories to implement the methods of the present invention.

The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. 

What is claimed is:
 1. A method for transmitting trustworthy data, said method comprising: receiving, by a processor of a computer system, a data file (F₀) of raw data comprising content, wherein F₀ is a version zero of the data file; tracking, by the processor, changes to the content of the raw data file, the changes producing n changed versions of the data file, wherein n is a positive integer of at least 1, and wherein changed version j of the data file is denoted as F_(j) for each positive integer j between 1 and n inclusive; determining, by the processor, content that was changed in each version F₁, . . . , F_(n) of the data file; calculating, by the processor, a trust index TX_(n) associated with the changed version F_(n) of the data file, wherein said calculating TX_(n) is based on a cumulative number of changes between successive versions F₀, F₁, . . . , F_(n) of the data file; and in response to a request for F_(n) received from a computing device, said processor transmitting F_(n) and TX_(n) to the computing device.
 2. The method of claim 1, wherein said calculating TX_(n) comprises summing a number of changes made between the successive versions F₀, F₁, . . . , F_(n) of the data files.
 3. The method of claim 1, wherein said calculating TX_(n) is performed in accordance with the formulas of: ${TX}_{n} = \frac{C\left( F_{0} \right)}{{C\left( F_{0} \right)} + {{DELTA}_{n}(F)}}$ ${{DELTA}_{n}(F)} = {\sum\limits_{t = 1}^{n}{{DELTA}\left( F_{t} \right)}}$ wherein C(F₀) is a total number of elements in file F₀, and wherein DELTA(F_(t)) is a total number of elements changed between versions F_(t-1) and F_(t) of the data file for 1≦t≦n.
 4. The method of claim 1, wherein the trust index TX_(n) is used as a Key Performance Indicator for the Veracity of the changed version of the data.
 5. A computer program product, comprising: a hardware storage device having computer readable program code stored therein, said program code containing instructions executable by a processor of a computer system to implement a method for transmitting trustworthy data, said method comprising: receiving, by the processor, a data file (F₀) of raw data comprising content, wherein F₀ is a version zero of the data file; tracking, by the processor, changes to the content of the raw data file, the changes producing n changed versions of the data file, wherein n is a positive integer of at least 1, and wherein changed version j of the data file is denoted as F_(j) for each positive integer j between 1 and n inclusive; determining, by the processor, content that was changed in each version F₁, . . . , F_(n) of the data file; and calculating, by the processor, a trust index TX_(n) associated with the changed version F_(n) of the data file, wherein said calculating TX_(n) is based on a cumulative number of changes between successive versions F₀, F₁, . . . , F_(n) of the data file; and in response to a request for F_(n) received from a computing device, said processor transmitting F_(n) and TX_(n) to the computing device.
 6. The computer program product of claim 5, wherein said calculating TX_(n) comprises summing a number of changes made between the successive versions F₀, F₁, . . . , F_(n) of the data files.
 7. The computer program product of claim 5, wherein said calculating TX_(n) is performed in accordance with the formulas of: ${TX}_{n} = \frac{C\left( F_{0} \right)}{{C\left( F_{0} \right)} + {{DELTA}_{n}(F)}}$ ${{DELTA}_{n}(F)} = {\sum\limits_{t = 1}^{n}{{DELTA}\left( F_{t} \right)}}$ wherein C(F₀) is a total number of elements in file F₀, and wherein DELTA(F_(t)) is a total number of elements changed between versions F_(t-1) and F_(t) of the data file for 1≦t≦n.
 8. The computer program product of claim 5, wherein the trust index TX_(n) is used as a Key Performance Indicator for the Veracity of the changed version of the data.
 9. A computer system, comprising: a processor, a memory, and a computer readable hardware storage device having computer readable program code stored therein, said program code executable by the processor via the memory to implement a method for transmitting trustworthy data, said method comprising: receiving, by the processor, a data file (F₀) of raw data comprising content, wherein F₀ is a version zero of the data file; tracking, by the processor, changes to the content of the raw data file, the changes producing n changed versions of the data file, wherein n is a positive integer of at least 1, and wherein changed version j of the data file is denoted as F_(j) for each positive integer j between 1 and n inclusive; determining, by the processor, content that was changed in each version F₁, . . . , F_(n) of the data file; and calculating, by the processor, a trust index TX_(n) associated with the changed version F_(n) of the data file, wherein said calculating TX_(n) is based on a cumulative number of changes between successive versions F₀, F₁, . . . , F_(n) of the data file; and in response to a request for F_(n) received from a computing device, said processor transmitting F_(n) and TX_(n) to the computing device.
 10. The computer system of claim 9, wherein said calculating TX_(n) comprises summing a number of changes made between the successive versions F₀, F₁, . . . , F_(n) of the data files.
 11. The computer system of claim 9, wherein said calculating TX_(n) is performed in accordance with the formulas of: ${TX}_{n} = \frac{C\left( F_{0} \right)}{{C\left( F_{0} \right)} + {{DELTA}_{n}(F)}}$ ${{DELTA}_{n}(F)} = {\sum\limits_{t = 1}^{n}{{DELTA}\left( F_{t} \right)}}$ wherein C(F₀) is a total number of elements in file F₀, and wherein DELTA(F_(t)) is a total number of elements changed between versions F_(t-1) and F_(t) of the data file for 1≦t≦n.
 12. The computer system of claim 9, wherein the trust index TX_(n) is used as a Key Performance Indicator for the Veracity of the changed version of the data. 